Total 4-Choosability of Series-Parallel Graphs
نویسنده
چکیده
It is proved that, if G is a K4-minor-free graph with maximum degree 3, then G is totally 4-choosable; that is, if every element (vertex or edge) of G is assigned a list of 4 colours, then every element can be coloured with a colour from its own list in such a way that every two adjacent or incident elements are coloured with different colours. Together with other known results, this shows that the List-Total-Colouring Conjecture, that ch(G) = χ(G) for every graph G, is true for all K4-minor-free graphs and, therefore, for all outerplanar graphs.
منابع مشابه
Bounds on circular consecutive choosability
The circular consecutive choosability chcc(G) of a graph G has been recently introduced in [2]. In this paper we prove upper bounds on chcc for series-parallel graphs, planar graphs and k-choosable graphs. Our bounds are tight for classes of series-parallel graphs and k-choosable graphs for k ≥ 3. Then we study the circular consecutive choosability of generalized theta graphs. Lower bounds for ...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملChoosability, Edge Choosability, and Total Choosability of Outerplane Graphs
Let χl (G), χ ′ l (G), χ ′′ l (G), and 1(G) denote, respectively, the list chromatic number, the list chromatic index, the list total chromatic number, and the maximum degree of a non-trivial connected outerplane graph G. We prove the following results. (1) 2 ≤ χl (G) ≤ 3 and χl (G) = 2 if and only if G is bipartite with at most one cycle. (2) 1(G) ≤ χ ′ l (G) ≤ 1(G) + 1 and χ ′ l (G) = 1(G) + ...
متن کاملOn Group Choosability of Total Graphs
In this paper, we study the group and list group colorings of total graphs and present group coloring versions of the total and list total colorings conjectures.We establish the group coloring version of the total coloring conjecture for the following classes of graphs: graphs with small maximum degree, two-degenerate graphs, planner graphs with maximum degree at least 11, planner graphs withou...
متن کاملEdge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
Let G be a planar graph with no two 3-cycles sharing an edge. We show that if ∆(G) ≥ 9, then χ′l(G) = ∆(G) and χ ′′ l (G) = ∆(G) + 1. We also show that if ∆(G) ≥ 6, then χ ′ l(G) ≤ ∆(G) + 1 and if ∆(G) ≥ 7, then χ′′ l (G) ≤ ∆(G) + 2. All of these results extend to graphs in the projective plane and when ∆(G) ≥ 7 the results also extend to graphs in the torus and Klein bottle. This second edge-c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 13 شماره
صفحات -
تاریخ انتشار 2006